Re-Encryption Method Designed by Row Complete Matrix
نویسندگان
چکیده
منابع مشابه
Re-Encryption Method Designed by Row Complete Matrix
With the prevalence of Internet access, document storage has become a fundamental web service in recent years. One important topic is how to design a secure channel for efficiently sharing documents with another receiver. In this paper, we demonstrate a re-encryption method that is designed with row complete matrices. With this new method, the document owner can share a ciphertext in the cloud ...
متن کاملOn parallelizing matrix multiplication by the column-row method
We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisingly simple method for “consistent” parallel processing of sparse outer products (column-row vector products) over several processors, in a communication-avoiding setting where each processor has a copy of the input. T...
متن کاملGPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging
We present an algorithm for general sparse matrix-matrix multiplication (SpGEMM) on many-core architectures, such as GPUs. SpGEMM is implemented by iterative row merging, similar to merge sort, except that elements with duplicate column indices are aggregated on the fly. The main kernel merges small numbers of sparse rows at once using sub-warps of threads to realize an early compression effect...
متن کاملA Matrix Pencil Approach to the Row by Row Decoupling Problem for Descriptor Systems
The row by row decoupling problem (RRDP) for descriptor systems is considered using proportional state feedback and input transformation. Necessary and sufficient conditions for the solvability of the RRDP are provided. These solvability conditions can be readily verified. A constructive solution to the RRDP is given so that the desired feedback and input transformation matrices can be obtained...
متن کاملObtaining a Triangular Matrix by Independent Row-Column Permutations
Given a square (0, 1)-matrix A, we consider the problem of deciding whether there exists a permutation of the rows and a permutation of the columns of A such that after carrying out these permutations, the resulting matrix is triangular. The complexity of the problem was posed as an open question by Wilf [7] in 1997. In 1998, DasGupta et al. [3] seemingly answered the question, proving it is NP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/402890